Graphs in which all maximal bipartite subgraphs have the same order
نویسندگان
چکیده
منابع مشابه
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
We address the problem of enumeration of seating arrangements of married couples around a circular table such that no spouses seat next to each other and no k consecutive persons are of the same gender. While the case of k = 2 corresponds to the classical problème des ménages with a well-studied solution, no closed-form expression for number of arrangements is known when k ≥ 3. We propose a nov...
متن کاملDominating Bipartite Subgraphs in Graphs
A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.
متن کاملLong Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vertices in its own set than in the other. Every sequence of flips eventually produces a bipartite subgraph capturing more than half of the edges in the graph. Each flip gains at least one edge. For an n-vertex loopless mu...
متن کاملEfficient Enumeration of Bipartite Subgraphs in Graphs
Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enum...
متن کاملBipancyclic subgraphs in random bipartite graphs
A bipartite graph on 2n vertices is bipancyclic if it contains cycles of all even lengths from 4 to 2n. In this paper we prove that the random bipartite graph G(n, n, p) with p(n) À n−2/3 asymptotically almost surely has the following resilience property: Every Hamiltonian subgraph G′ of G(n, n, p) with more than (1/2 + o(1))n2p edges is bipancyclic. This result is tight in two ways. First, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2020
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-020-00700-x